Natural Deduction and Normalisation for Partially Commutative Linear Logic and Lambek Calculus with Product

نویسندگان

  • Maxime Amblard
  • Christian Retoré
چکیده

This paper provides a natural deduction system for Partially Commutative Intuitionistic Multiplicative Linear Logic (PCIMLL) and establishes its normalisation and subformula property. Such a system involves both commutative and non commutative connectives and deals with context that are series-parallel multisets of formulæ. This calculus is the extension of the one introduced by de Groote presented by the second order for modelling Petri net execution, with a full entropy which allow order to be relaxed into any suborder — as opposed to the Non Commutative Logic of Abrusci and Ruet. Our result also includes, as a special case, the normalisation of natural deduction the Lambek calculus with product, which is unsurprising but yet unproved. Up to now PCIMLL with full entropy had no natural deduction. In particular for linguistic applications, such a syntax is much welcome to construct semantic representations from syntactic analyses.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Normalization and sub-formula property for Lambek with product and PCMLL - Partially Commutative Multiplicative Linear Logic

This paper establishes the normalisation of natural deduction or lambda calculus formulation of Intuitionistic Non Commutative Logic — which involves both commutative and non commutative connectives. This calculus first introduced by de Groote and as opposed to the classical version by Abrusci and Ruet admits a full entropy which allow order to be relaxed into any suborder. Our result also incl...

متن کامل

Partially Commutative Linear Logic and Lambek Caculus with Product: Natural Deduction, Normalisation, Subformula Property

This article defines and studies a natural deduction system for partially commutative intuitionistic multiplicative linear logic, that is a combination of intuitionistic commutative linear logic with the Lambek calculus, which is noncommutative, and was first introduced as a sequent calculus by de Groote. In this logic, the hypotheses are endowed with a series-parallel partial order: the parall...

متن کامل

Proof Nets Construction and Automated Deduction in Non-commutative Linear Logic -extended Abstract

Proof nets can be seen as a multiple conclusion natural deduction system for Linear Logic (LL) and form a good formalism to analyze some computation mechanisms, for instance in type-theoretic interpretations. This paper presents an algorithm for automated proof nets construction in the non-commutative multiplicative linear logic that is useful for applications including planning, concurrency or...

متن کامل

Proof nets Construction and Automated Deduction in Non-Commutative Linear Logic

Proof nets can be seen as a multiple conclusion natural deduction system for Linear Logic (LL) and form a good formalism to analyze some computation mechanisms, for instance in type-theoretic interpretations. This paper presents an algorithm for automated proof nets construction in the non-commutative multiplicative linear logic that is useful for applications including planning, concurrency or...

متن کامل

Proof nets for the Lambek calculus — an overview

There are both linguistic and mathematical reasons for studying proof nets the perspective of categorial grammar. It is now well known that the Lambek calculus corresponds to intuitionnistic non-commutative multiplicative linear logic — with no empty antecedent, to be absolutely precise. As natural deduction underlines the constructive contents of intuitionistic logic (Curry-Howard isomorphism)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007